Accurate activity location prediction is a crucial component of many mobility applications and is particularly required to develop personalized, sustainable transportation systems. Despite the widespread adoption of deep learning models, next location prediction models lack a comprehensive discussion and integration of mobility-related spatio-temporal contexts. Here, we utilize a multi-head self-attentional (MHSA) neural network that learns location transition patterns from historical location visits, their visit time and activity duration, as well as their surrounding land use functions, to infer an individual's next location. Specifically, we adopt point-of-interest data and latent Dirichlet allocation for representing locations' land use contexts at multiple spatial scales, generate embedding vectors of the spatio-temporal features, and learn to predict the next location with an MHSA network. Through experiments on two large-scale GNSS tracking datasets, we demonstrate that the proposed model outperforms other state-of-the-art prediction models, and reveal the contribution of various spatio-temporal contexts to the model's performance. Moreover, we find that the model trained on population data achieves higher prediction performance with fewer parameters than individual-level models due to learning from collective movement patterns. We also reveal mobility conducted in the recent past and one week before has the largest influence on the current prediction, showing that learning from a subset of the historical mobility is sufficient to obtain an accurate location prediction result. We believe that the proposed model is vital for context-aware mobility prediction. The gained insights will help to understand location prediction models and promote their implementation for mobility applications.

We address 2D floorplan reconstruction from 3D scans. Existing approaches typically employ heuristically designed multi-stage pipelines. Instead, we formulate floorplan reconstruction as a single-stage structured prediction task: find a variable-size set of polygons, which in turn are variable-length sequences of ordered vertices. To solve it we develop a novel Transformer architecture that generates polygons of multiple rooms in parallel, in a holistic manner without hand-crafted intermediate stages. The model features two-level queries for polygons and corners, and includes polygon matching to make the network end-to-end trainable. Our method achieves a new state-of-the-art for two challenging datasets, Structured3D and SceneCAD, along with significantly faster inference than previous methods. Moreover, it can readily be extended to predict additional information, i.e., semantic room types and architectural elements like doors and windows. Our code and models will be available at: https://github.com/ywyue/RoomFormer.

The well-documented presence of texture bias in modern convolutional neural networks has led to a plethora of algorithms that promote an emphasis on shape cues, often to support generalization to new domains. Yet, common datasets, benchmarks and general model selection strategies are missing, and there is no agreed, rigorous evaluation protocol. In this paper, we investigate difficulties and limitations when training networks with reduced texture bias. In particular, we also show that proper evaluation and meaningful comparisons between methods are not trivial. We introduce BiasBed, a testbed for texture- and style-biased training, including multiple datasets and a range of existing algorithms. It comes with an extensive evaluation protocol that includes rigorous hypothesis testing to gauge the significance of the results, despite the considerable training instability of some style bias methods. Our extensive experiments, shed new light on the need for careful, statistically founded evaluation protocols for style bias (and beyond). E.g., we find that some algorithms proposed in the literature do not significantly mitigate the impact of style bias at all. With the release of BiasBed, we hope to foster a common understanding of consistent and meaningful comparisons, and consequently faster progress towards learning methods free of texture bias. Code is available at https://github.com/D1noFuzi/BiasBed

Fine-grained population maps are needed in several domains, like urban planning, environmental monitoring, public health, and humanitarian operations. Unfortunately, in many countries only aggregate census counts over large spatial units are collected, moreover, these are not always up-to-date. We present POMELO, a deep learning model that employs coarse census counts and open geodata to estimate fine-grained population maps with 100m ground sampling distance. Moreover, the model can also estimate population numbers when no census counts at all are available, by generalizing across countries. In a series of experiments for several countries in sub-Saharan Africa, the maps produced with POMELOare in good agreement with the most detailed available reference counts: disaggregation of coarse census counts reaches R2 values of 85-89%; unconstrained prediction in the absence of any counts reaches 48-69%.

与2D栅格图像不同，没有用于3D视觉数据处理的单个主导表示。点云，网格或隐式功能等不同格式都具有其优点和劣势。尽管如此，诸如签名距离函数之类的网格表示在3D中也具有吸引人的属性。特别是，它们提供恒定的随机访问，并且非常适合现代机器学习。不幸的是，网格的存储大小随其尺寸而呈指数增长。因此，即使在中等分辨率下，它们也经常超过内存限制。这项工作探讨了各种低量张量格式，包括Tucker，Tensor Train和Wartenics Tensor tensor tensor tensor tensor分解，以压缩时间变化的3D数据。我们的方法迭代地计算，体素化和压缩每个帧的截断符号距离函数，并将张量式截断施加到代表整个4D场景的单个压缩张量中，将所有框架凝结到一个单个压缩张量中。我们表明，低级张量压缩对于存储和查询时间变化的签名距离功能非常紧凑。它大大降低了4D场景的内存足迹，同时令人惊讶地保留了它们的几何质量。与现有的基于迭代学习的方法（如DEEPSDF和NERF）不同，我们的方法使用具有理论保证的封闭式算法。

在自动驾驶汽车和移动机器人上使用的多光束liDAR传感器可获得3D范围扫描的序列（“帧”）。由于有限的角度扫描分辨率和阻塞，每个框架都稀疏地覆盖了场景。稀疏性限制了语义分割或表面重建等下游过程的性能。幸运的是，当传感器移动时，帧将从一系列不同的观点捕获。这提供了互补的信息，当积累在公共场景坐标框架中时，会产生更密集的采样和对基础3D场景的更完整覆盖。但是，扫描场景通常包含移动对象。这些对象上的点不能仅通过撤消扫描仪的自我运动来正确对齐。在本文中，我们将多帧点云积累作为3D扫描序列的中级表示，并开发了一种利用室外街道场景的感应偏见的方法，包括其几何布局和对象级刚性。与最新的场景流估计器相比，我们提出的方法旨在使所有3D点在共同的参考框架中对齐，以正确地积累各个对象上的点。我们的方法大大减少了几个基准数据集上的对齐错误。此外，累积的点云使诸如表面重建之类的高级任务受益。

我们提出了Tntorch，这是一个张量学习框架，该框架支持统一界面下的多个分解（包括CandeComp/Parafac，Tucker和Tensor Train）。借助我们的库，用户可以通过自动差异，无缝的GPU支持以及Pytorch的API的便利性学习和处理低排名的张量。除分解算法外，TNTORCH还实施可区分的张量代数，等级截断，交叉透视，批处理处理，全面的张量算术等。

世界上最大的可可生产国C \^ote d'Ivoire and Ghana占全球可可生产的三分之二。在这两个国家，可可都是多年生作物，为近200万农民提供收入。然而，缺少可可种植区域的精确地图，阻碍了保护区，生产和产量的准确量化，并限制了可用于改善可持续性治理的信息。在这里，我们将可可种植园数据与公开可用的卫星图像结合在深度学习框架中，并为两国的可可种植园创建高分辨率地图，并被现场验证。我们的结果表明，可可栽培是C \^ote d'Ivoire和Ghane的保护区中森林损失的37％以上和13％的潜在驱动因素，该官员报告大大低估了种植的地区，最高40％在加纳。这些地图是提高可可生产地区保护和经济发展的关键基础。

The ability to estimate epistemic uncertainty is often crucial when deploying machine learning in the real world, but modern methods often produce overconfident, uncalibrated uncertainty predictions. A common approach to quantify epistemic uncertainty, usable across a wide class of prediction models, is to train a model ensemble. In a naive implementation, the ensemble approach has high computational cost and high memory demand. This challenges in particular modern deep learning, where even a single deep network is already demanding in terms of compute and memory, and has given rise to a number of attempts to emulate the model ensemble without actually instantiating separate ensemble members. We introduce FiLM-Ensemble, a deep, implicit ensemble method based on the concept of Feature-wise Linear Modulation (FiLM). That technique was originally developed for multi-task learning, with the aim of decoupling different tasks. We show that the idea can be extended to uncertainty quantification: by modulating the network activations of a single deep network with FiLM, one obtains a model ensemble with high diversity, and consequently well-calibrated estimates of epistemic uncertainty, with low computational overhead in comparison. Empirically, FiLM-Ensemble outperforms other implicit ensemble methods, and it and comes very close to the upper bound of an explicit ensemble of networks (sometimes even beating it), at a fraction of the memory cost.

我们的目标是从单个图像中恢复3D形状和姿势。这是一项艰巨的任务，因为狗表现出各种形状和外表，并且高度阐明。最近的工作提出了直接从图像中直接带有其他肢体规模参数的Smal动物模型。我们的方法称为BARC（使用分类的品种调查回归），以几种重要方式超越了先前的工作。首先，我们修改SMAL形状空间，以更适合表示狗形。但是，即使具有更好的形状模型，从图像中回归狗形状的问题仍然具有挑战性，因为我们缺少具有3D地面真相的配对图像。为了弥补缺乏配对数据的缺乏，我们制定了利用有关狗品种信息的新损失。特别是，我们利用了同一品种的狗具有相似的身体形状的事实。我们制定了一个新型的品种相似性损失，包括两个部分：一个术语鼓励同一品种的狗形状比不同品种的狗更相似。第二个是品种分类损失，有助于产生可识别的品种特异性形状。通过消融研究，我们发现我们的品种损失显着提高了没有它们的基线的形状精度。我们还通过知觉研究将BARC与WLDO进行定性比较，并发现我们的方法产生的狗更现实。这项工作表明，有关遗传相似性的A-Priori信息可以帮助弥补缺乏3D培训数据。这个概念可能适用于其他动物物种或种类。我们的代码可在https://barc.is.tue.mpg.de/上公开提供。